Efficient Multi-Identity Full Homomorphic Encryption Scheme on Lattice
نویسندگان
چکیده
Aiming at the problem that fully homomorphic encryption scheme based on single identity cannot satisfy operation of ciphertext under different identities, as well inefficiency trapdoor function and complexity sampling algorithm, an improved lattice MIBFHE was proposed. Firstly, we combined MP12 with dual LWE algorithm to construct a new IBE standard model, prove is IND-sID-CPA security selective identity. Secondly, used eigenvector method eliminate evaluation key, transform above efficient into IBFHE operation. Finally, extension CM15 constructed Link-mask system supports transformation then, converted this system. The comparative analysis results showed efficiency compared similar schemes in generation preimage sampling, dimension size are significantly shortened.
منابع مشابه
Lattice Attacks on the DGHV Homomorphic Encryption Scheme
In 2010, van Dijk, Gentry, Halevi, and Vaikuntanathan described the first fully homomorphic encryption over the integers, called DGHV. The scheme is based on a set of m public integers ci = pqi + ri, i = 1, · · · ,m, where the integers p, qi and ri are secret. In this paper, we describe two lattice-based attacks on DGHV. The first attack is applicable when r1 = 0 and the public integers ci sati...
متن کاملLattice Forward-Secure Identity Based Encryption Scheme
Protecting secret keys is crucial for cryptography. There are some relatively insecure devices (smart cards, mobile phones etc.) which have threat of key exposure. The goal of the forward security is to protect security of past uses of key even if the current secret key is exposed. In this paper we propose lattice based forward-secure identity based encryption scheme based on LWE assumption in ...
متن کاملAn Efficient Somewhat Homomorphic Encryption Scheme Based on Factorization
Surprisingly, most of existing provably secure FHE or SWHE schemes are lattice-based constructions. It is legitimate to question whether there is a mysterious link between homomorphic encryptions and lattices. This paper can be seen as a rst (partial) negative answer to this question. We propose a very simple private-key (partially) homomorphic encryption scheme whose security relies on factori...
متن کاملMulti-integer Somewhat Homomorphic Encryption Scheme with China Remainder Theorem
As an effective solution to protect the privacy of the data, homomorphic encryption has become a hot research topic. Existing homomorphic schemes are not truly practical due to their high computational complexity and huge key size. In 2013, Coron et al. proposed a batch homomorphic encryption scheme, i.e. a scheme that supports encrypting and homomorphically evaluating several plaintext bits as...
متن کاملTowards Secure the Multi-Cloud using Homomorphic Encryption Scheme
Cloud computing is a model to acces shared pool of configurable computing resources which include servers, storage, applications, and also services to network effort or service interaction provider . This cloud model promotes availability and is composed of five essential fetures, in that service models are three, and four are deployment models. However, as the shape of the cloud computing is e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied sciences
سال: 2023
ISSN: ['2076-3417']
DOI: https://doi.org/10.3390/app13106343